Tree decomposition

Results: 411



#Item
171Probability theory / Artificial intelligence / Markov random field / Theoretical computer science / Chordal graph / Tree decomposition / Clique / Matching / Belief propagation / Graph theory / Graph operations / Graphical models

1646 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 28,

Add to Reading List

Source URL: webdocs.cs.ualberta.ca

Language: English - Date: 2006-08-28 13:27:03
172NP-complete problems / Parameterized complexity / Kernelization / Path decomposition / Vertex cover / Feedback vertex set / Dominating set / Tree decomposition / Clique / Graph theory / Theoretical computer science / Mathematics

New Races in Parameterized Algorithmics Christian Komusiewicz and Rolf Niedermeier Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany {christian.komusiewicz,rolf.niedermeier}@tu-berlin.de

Add to Reading List

Source URL: fpt.akt.tu-berlin.de

Language: English - Date: 2012-08-07 06:26:48
173NP-complete problems / Tree / Clique / Path decomposition / Graph coloring / Graph theory / Theoretical computer science / Mathematics

Bandwidth Approximation of a Restricted Family of Trees Abstract Bandwidth is one of the canonical NP-complete problemsIt is NP-hard to approximate within any constant, even on treesGupta gave a randomized

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2009-12-02 23:05:21
174Lepidoptera / Polynomials / Tree decomposition / Approximation algorithm / Caterpillar / Polylogarithmic / Theoretical computer science / Graph theory / Mathematics

Bandwidth Approximation of Many-Caterpillars Yuval Filmus September 1, 2009 Abstract Bandwidth is one of the canonical NPcomplete problems. It is NP-hard to approximate

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2009-12-02 23:07:07
175Constraint programming / Constraint satisfaction problem / Constraint satisfaction / Exponential time hypothesis / Boolean satisfiability problem / NP-complete / Tree decomposition / Conjunctive normal form / Time complexity / Theoretical computer science / Applied mathematics / Computational complexity theory

Journal of Artificial Intelligence Research234 Submitted 8/14; published 1/15 On the Subexponential-Time Complexity of CSP Ronald de Haan

Add to Reading List

Source URL: www.jair.org

Language: English - Date: 2015-01-30 21:27:29
176Tree / Graph coloring / Minor / Path decomposition / Planar separator theorem / Graph theory / Graph operations / Planar graph

An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs Jon Kleinberg ∗ Abstract

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 2005-08-11 23:51:43
177Tree decomposition / Interval graph / Floyd–Warshall algorithm / Neighbourhood / Clique / Split graph / Shortest path problem / Path decomposition / Degeneracy / Graph theory / Graph operations / Chordal graph

Journal of Artificial Intelligence Research–388 Submitted 10/11; publishedComputing All-Pairs Shortest Paths by Leveraging Low Treewidth

Add to Reading List

Source URL: www.jair.org

Language: English - Date: 2012-03-19 16:09:33
178Minimum spanning tree / Tree decomposition / Connectivity / Tree / Planar separator theorem / Graph theory / Spanning tree / Geometric spanner

Euclidean Spanners: Short, Thin, and Lanky Sunil Arya Gautam Dasy

Add to Reading List

Source URL: www.cse.ust.hk

Language: English - Date: 2006-04-06 21:38:27
179NP-complete problems / Graph operations / Dominating set / Neighbourhood / Tree decomposition / Tree / Planar graph / Graph / Degree / Graph theory / Mathematics / Theoretical computer science

Approximating k-center in planar graphs David Eisenstat∗ Philip N. Klein∗ Abstract

Add to Reading List

Source URL: www.di.ens.fr

Language: English - Date: 2013-10-10 10:36:31
180Graph operations / Connectivity / Tree decomposition / Graph / Travelling salesman problem / Tree / Line graph / Chordal graph / Graph theory / NP-complete problems / Graph coloring

Algorithms CS 6820 Fall 2009 Problem Set 5 Due November 11, 2009

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 2009-10-30 17:40:59
UPDATE